Satisfiability and Systematicity
نویسنده
چکیده
We introduce a new notion of systematicity for satisfiability algorithms with restarts, saying that an algorithm is strongly systematic if it is systematic independent of restart policy but weakly systematic if it is systematic for some restart policies but not others. We show that existing satisfiability engines are generally only weakly systematic, and describe flex, a strongly systematic algorithm that uses an amount of memory polynomial in the size of the problem. On large number factoring problems, flex appears to outperform weakly systematic approaches.
منابع مشابه
Extending Systematic Local Search for Job Shop Scheduling Problems
Hybrid search methods synthesize desirable aspects of both constructive and local search methods. Constructive methods are systematic and complete, but exhibit poor performance on large problems because bad decisions made early in the search persist for exponentially long times. In contrast, stochastic local search methods are immune to the tyranny of early mistakes. Local search methods replac...
متن کاملOn the Systematicity of Language and Thought
The last twenty years or so have seen a lot of discussion about systematicity-roughly the idea that if a person's repertoire contains the sentence/thought thatJohn loves Mary, then her repertoire also contains the sentence/thought that Mary loves John.' Much of the discussion of systematicity has focused on the technical question of whether and how connectionists can explain the systematicity o...
متن کاملConnectionism and the Problem of Systematicity
Systematicity is a pervasive property of cognitive behaviour (e.g., language and reasoning) whereby the ability to represent (systematicity of representation) and infer from (systematicity of inference) some instances of a structured object extends to other instances conforming to the same structure (Fodor & Pylyshyn, 1988; Fodor & McLaughlin, 1990). The problem of systematicity for a Connectio...
متن کاملSecond-Order Systematicity of Associative Learning: A Paradox for Classical Compositionality and a Coalgebraic Resolution
Systematicity is a property of cognitive architecture whereby having certain cognitive capacities implies having certain other "structurally related" cognitive capacities. The predominant classical explanation for systematicity appeals to a notion of common syntactic/symbolic structure among the systematically related capacities. Although learning is a (second-order) cognitive capacity of centr...
متن کاملSystematicity and a Categorical Theory of Cognitive Architecture: Universal Construction in Context
Why does the capacity to think certain thoughts imply the capacity to think certain other, structurally related, thoughts? Despite decades of intensive debate, cognitive scientists have yet to reach a consensus on an explanation for this property of cognitive architecture-the basic processes and modes of composition that together afford cognitive capacity-called systematicity. Systematicity is ...
متن کامل